Match-bounds revisited
نویسندگان
چکیده
منابع مشابه
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion of consistency. Bounds consistency is the method of choice for building propagators for arithmetic constraints and several global constraints in the finite ...
متن کاملBounds on heavy sterile neutrinos revisited
We revise the bounds on heavy sterile neutrinos, especially in the case of their mixing with muon neutrinos in the charged current. We summarize the present experimental limits, and we reanalyze the existing data from the accelerator neutrino experiments and from Super-Kamiokande to set new bounds on a heavy sterile neutrino in the range of masses from 8 MeV to 390 MeV. We also discuss how the ...
متن کاملMultiple importance sampling revisited: breaking the bounds
We revisit the multiple importance sampling (MIS) estimator and investigate the bound on the efficiency improvement over balance heuristic estimator with equal count of samples established in Veach’s thesis. We revise the proof for this and come to the conclusion that there is no such bound and henceforth it makes sense to look for new estimators that improve on balance heuristic estimator with...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملLow upper bounds in the Turing degrees revisited
We give an alternative proof of a result of Kučera and Slaman (2009, Lower upper bounds of ideals, Journal of Symbolic Logic, 74, 517–534) on low bounds of ideals in the 2 Turing degrees. This is a characterization of the ideals in the 0 2 degrees which have a low upper bound. It follows that there is a low upper bound for the ideal of the K-trivial degrees. Our proof is direct, in the sense th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2009
ISSN: 0890-5401
DOI: 10.1016/j.ic.2009.02.010